Genetic neighbourhood sizes in Primula vulgaris
نویسندگان
چکیده
منابع مشابه
Genetic Variation in Natural and Cultivated Populations of Primula Veris
Primula veris, a well-known pharmaceutical plant, is a long-lived perennial protected by law in Poland, so its rhizomes and roots can be collected as pharmaceutical stock only from cultivation. Genetic variation of three natural P. veris populations numbering 500–1200 individuals and of three cultivated populations derived from seeds collected from natural sites was investigated in respect of t...
متن کاملComparison of Di erent Neighbourhood Sizes in Simulated Annealing
Neighbourhood structure and size are important parameters in local search algorithms. This is also true for generalised local search algorithms like simulated annealing. It has been shown that the performance of simulated annealing can be improved by adopting a suitable neighbourhood size. However, previous studies usually assumed that the neighbourhood size was xed during search. This paper pr...
متن کاملFloral heteromorphy in Primula vulgaris: progress towards isolation and characterization of the S locus.
BACKGROUND The common primrose, Primula vulgaris, along with many other species of the Primulaceae, exhibits floral heteromorphy in which different individuals develop one of two possible forms of flower, known as pin and thrum. Both flower types are hermaphrodite and exhibit reciprocal positions of male and female reproductive structures, which together with a sporophytic incompatibility syste...
متن کاملMolecular characterization of DNA sequences from the Primula vulgaris S-locus.
Primula species provide possibly the best known examples of heteromorphic flower development and this breeding system has attracted considerable attention, including that of Charles Darwin. However, despite considerable recent advances in molecular genetics, nothing is known about the molecular basis of floral heteromorphy. The first molecular marker for the Primula S-locus is reported here. Th...
متن کاملGenetic Algorithms and Neighbourhood Search
Genetic algorithms (GAs) have proved to be a versatile and eeective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not perform particularly well, and various methods of hybridization have been proposed. These often involve incorporating other methods such as simulated annealing or local optimization as anàdd-on' extr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Heredity
سال: 1985
ISSN: 0018-067X,1365-2540
DOI: 10.1038/hdy.1985.9